例句與造句

1. In general, most routing software determines a route through a shortest path algorithm.
2. When provisioning a circuit, engineers typically use a shortest path algorithm, such as Dijkstra.
3. Despite variations in parameters, the K shortest path algorithms finds the most optimal solutions that satisfies almost all user needs.
4. Another use of K shortest path algorithms is to design a transit network that enhances passengers'experience in public transportation systems.
5. After obtaining the transformed graph one would simply compute the primary path using a known shortest path algorithm such as Dijkstra s.
6. It's difficult to find shortest path algorithms in a sentence. 用shortest path algorithms造句挺難的
7. He was also well known for his work regarding the building of computer operating systems and other areas in the field, including his shortest path algorithm.
8. It can be initialized in time O ( n ^ 3 ) using an all-pairs shortest paths algorithm, such as the Floyd Warshall algorithm.
9. As a result, the shortest path algorithm is widely used in network routing protocols, most notably IS-IS and Open Shortest Path First ( OSPF ).
10. Many of the optical impairments are nonlinear, so a standard shortest path algorithm can't be used to solve them optimally even if we know the exact state of the network.
11. Such applications of K shortest path algorithms are becoming common, recently Xu, He, Song, and Chaudry ( 2012 ) studied the K shortest path problems in transit network systems.
12. The main advantage of using this approach is that efficient shortest path algorithms introduced for the deterministic networks can be readily employed to identify the path with the minimum expected travel time in a stochastic network.
13. Henzinger et . al . extended Frederickson's " r "-division technique for the single source shortest path algorithm in planar graphs for nonnegative edge-lengths and proposed a linear time algorithm.
14. Using the Floyd Warshall algorithm all pairs shortest path algorithm, we include intermediate nodes iteratively, and get \ Theta ( n ) time, using \ Theta ( n ^ 2 ) processors and \ Theta ( n ^ 3 ) work.
15. For example, if vertices represent the states of a puzzle like a Rubik's Cube and each directed edge corresponds to a single move or turn, shortest path algorithms can be used to find a solution that uses the minimum possible number of moves.
16. Marc van Kreveld suggested the algorithmic problem of computing shortest paths between vertices in a line arrangement, where the paths are restricted to follow the edges of the arrangement, more quickly than the quadratic time that it would take to apply a shortest path algorithm to the whole arrangement graph.
更多例句：  下一頁